characterization of g2(q), where 2 < q = 1(mod3) by order components
Authors
abstract
in this paper we will prove that the simple group g2(q) where 2 < q = 1(mod3)is recognizable by the set of its order components, also other word we prove that if g is a nite group with oc(g) = oc(g2(q)), then g is isomorphic to g2(q).
similar resources
Characterization of $G_2(q)$, where $2 < q equiv 1(mod 3)$ by order components
In this paper we will prove that the simple group $G_2(q)$, where $2 < q equiv 1(mod3)$ is recognizable by the set of its order components, also other word we prove that if $G$ is a finite group with $OC(G)=OC(G_2(q))$, then $G$ is isomorphic to $G_2(q)$.
full textcharacterization of g2(q), where 2 < q = 1(mod3) by order components
in this paper we will prove that the simple group g2(q) where 2 < q = 1(mod3)is recognizable by the set of its order components, also other word we prove that if g is a nite group with oc(g) = oc(g2(q)), then g is isomorphic to g2(q).
full textA NEW CHARACTERIZATION OF SIMPLE GROUP G 2 (q) WHERE q ⩽ 11
Let G be a finite group , in this paper using the order and largest element order of G we show that every finite group with the same order and largest element order as G 2 (q), where q 11 is necessarily isomorphic to the group G 2 (q)
full textA characterization of C 2 ( q ) where q > 5
The order of every finite group G can be expressed as a product of coprime positive integers m1, . . . ,mt such that π(mi) is a connected component of the prime graph of G. The integers m1, . . . ,mt are called the order components of G. Some nonabelian simple groups are known to be uniquely determined by their order components. As the main result of this paper, we show that the projective symp...
full textquasirecognition by prime graph of $u_3(q)$ where $2 < q =p^{alpha} < 100$
let $g $ be a finite group and let $gamma(g)$ be the prime graph of g. assume $2 < q = p^{alpha} < 100$. we determine finite groups g such that $gamma(g) = gamma(u_3(q))$ and prove that if $q neq 3, 5, 9, 17$, then $u_3(q)$ is quasirecognizable by prime graph, i.e. if $g$ is a finite group with the same prime graph as the finite simple group $u_3(q)$, then $g$ has a un...
full textQuasirecognition by the prime graph of L_3(q) where 3 < q < 100
Let $G$ be a finite group. We construct the prime graph of $ G $,which is denoted by $ Gamma(G) $ as follows: the vertex set of thisgraph is the prime divisors of $ |G| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ G $ contains anelement of order $ pq $.In this paper, we determine finite groups $ G $ with $ Gamma(G) =Gamma(L_3(q)) $, $2 leq q < 100 $ and prov...
full textMy Resources
Save resource for easier access later
Journal title:
journal of linear and topological algebra (jlta)جلد ۴، شماره ۰۱، صفحات ۱۱-۲۳
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023